Method and system for performing permutations with bit permutation instructions

ABSTRACT

The present invention provides permutation instructions which can be used in software executed in a programmable processor for solving permutation problems in cryptography, multimedia and other applications. PPERM and PPERM3R instructions are defined to perform permutations by a sequence of instructions with each sequence specifying the position in the source for each bit in the destination. In the PPERM instruction bits in the destination register that change are updated and bits in the destination register that do not change are set to zero. In the PPERM3R instruction bits in the destination register that change are updated and bits in the destination register that do not change are copied from intermediate result of previous PPERM3R instructions. Both PPERM and PPERM3R instruction can individually do permutation with bit repetition. Both PPERM and PPERM3R instruction can individually do permutation of bits stored in more than one register. In an alternate embodiment, a GRP instruction is defined to perform permutations. The GRP instruction divides the initial sequence in the source register into two groups depending on control bits. The first group is combined with the second group to form an intermediate sequence toward the desired final permutation. The total number of GRP instructions for a bit level permutation of n bits is not greater than 1gn. The GRP instruction can be used to permute k-bit subwords packed into an n bits word, where k can be 1, 2, . . . , or n bits, and k*r=n. At most 1gr permutation instructions are used in the permutation instruction sequence, where r is the number of k-bit subwords to be permuted. The GRP instruction can also be used to permute 2n bits stored in two n-bit registers. The total number of instructions for bit permutation of 2n bits is 21gn+4, and two of those instructions are SHIFT PAIR instruction.

Cross-Reference to Related Application

This application is a divisional of U.S. patent application Ser. No. 09/850,239 filed May 7, 2001, now U.S. Pat. No. 7,174,014 which claims priority on U.S. Provisional Patent Application No. 60/202,250 filed May 5, 2000, hereby incorporated in its entirety by reference into this application.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a method and system for performing permutations of a sequence of bits in a programmable processor.

2. Description of the Related Art

The need for secure information processing has increased with the increasing use of the public internet and wireless communications in e-commerce, e-business and personal use. Typical use of the internet is not secure. Secure information processing typically includes authentication of users and host machines, confidentiality of messages sent over public networks, and assurances that messages, programs and data have not been maliciously changed. Conventional solutions have provided security functions by using different security protocols employing different cryptographic algorithms, such as public key, symmetric key and hash algorithms.

For encrypting large amounts of data symmetric key cryptography algorithms have been used, see Bruce Schneier, “Applied Cryptography”, 2^(nd) Ed., John Wiley & Sons, Inc., 1996. These algorithms use the same secret key to encrypt and decrypt a given message, and encryption and decryption have the same computational complexity. In symmetric key algorithms, the cryptographic techniques of “confusion” and “diffusion” are synergistically employed. “Confusion” obscures the relationship between the plaintext (original message) and the ciphertext (encrypted message), for example, through substitution of arbitrary bits for bits in the plaintext. “Diffusion” spread the redundancy of the plaintext over the ciphertext, for example through permutation of the bits of the plaintext block. Such bit-level permutations have the drawback of being slow when implemented with conventional instructions available in microprocessors and other programmable processors.

Bit-level permutations are particularly difficult for processors, and have been avoided in the design of new cryptography algorithms, where it is desired to have fast software implementations, for example in the Advanced Encryption Standard, as described in NIST, “Announcing Request for Candidate Algorithm Nominations for the Advanced Encryption Standard (AES)”, http://csrc.nist.gov/encryption/aes/pre-round1/aes 9709.htm, Since conventional microprocessors are word-oriented, performing bit-level permutations is difficult and tedious. Every bit has to be extracted from the source register, moved to its new location in the destination register, and combined with the bits that have already been moved. This requires 4 instructions per bit (mask generation, AND, SHIFT, OR), and 4n instructions to perform an arbitrary permutation of n bits. Conventional microprocessors, for example Precision Architecture (PA-RISC) have been described to provide more powerful bit-manipulation capabilities using EXTRACT and DEPOSIT instructions, which can essentially perform the four operations required for each bit in 2 instructions (EXTRACT, DEPOSIT), resulting in 2n instructions for any arbitrary permutation of n bits, see Ruby Lee, “Precision Architecture”, IEEE Computer, Vol. 22, No. 1, pp. 78-91, January 1989. Accordingly, an arbitrary 64-bit permutation could take 128 or 256 instructions on this type of conventional microprocessor. Pre-defined permutations with some regular patterns have been implemented in fewer instructions, for example, the permutations in DES, as described in Bruce Schneier, “Applied Cryptography”, 2^(nd) Ed., John Wiley & Sons, Inc., 1996.

Conventional techniques have also used table lookup methods to implement fixed permutations. To achieve a fixed permutation of n input bits with one table lookup, a table with 2^(n) entries is used with each entry being n bits. For a 64-bit permutation, this type of table lookup would use 2⁶⁷ bytes, which is clearly infeasible. Alternatively, the table can be broken up into smaller tables, and several table lookup operations could be used. For example, a 64-bit permutation could be implemented by permuting 8 consecutive bits at a time, then combining these 8 intermediate permutations into a final permutation. This method requires 8 tables, each with 256 entries, each entry being 64 bits. Each entry has zeros in all positions, except the 8 bit positions to which the selected 8 bits in the source are permuted. After the eight table lookups done by 8 LOAD instructions, the results are combined with 7 OR instructions to get the final permutation. In addition, 8 instructions are needed to extract the index for the LOAD instruction, for a total of 23 instructions. The memory requirement is 8*256*8=16 kilobytes for eight tables. Although 23 instructions is less than the 128 or 256 instructions used in the previous method, the actual execution time can be much longer due to cache miss penalties or memory access latencies. For example, if half of the 8 Load instructions miss in the cache, and each cache miss takes 50 cycles to fetch the missing cache line from main memory, the actual execution time is more than 4*50=200 cycles. Accordingly, this method can be longer than the previously described 128 cycles using EXTRACT and DEPOSIT. This method also has the drawback of a memory requirement of 16 kilobytes for the tables.

Permutations are a requirement for fast processing of digital multimedia information, using subword-parallel instructions, more commonly known as multimedia instructions, as described in Ruby Lee, “Accelerating Multimedia with Enhanced Micro-processors”, IEEE Micro, Vol. 15, No. 2, pp. 22-32, April 1995, and Ruby Lee, “Subword Parallelism in MAX-2”, IEEE Micro, Vol. 16, No. 4, pp. 51-59, August 1996. The MAX-2 general-purpose PERMUTE instructions can do any permutation, with and without repetitions, of the subwords packed in a 64-bit register. However, it is only defined for 16-bit subwords. MIX and MUX instructions have been implemented in the IA-64 architectures, which are extensions to the MIX and PERMUTE instructions of MAX-2, see Intel Corporation, “IA-64 Application Developer's Architecture Guide”, Intel Corporation, May 1999. The IA-64 uses MUX instruction, which is a fully general permute instruction for 16-bit subwords, with five new permute byte variants. A VPERM instruction has been used in an AltiVec extension to the Power PC™ available from IBM Corporation, Armonk, N.Y., see Motorola Corporation, “‘AltiVec Extensions to PowerPC’ Instruction Set Architecture Specification”, Motorola Corporation, May 1998. The Altivec VPERM instruction extends the general permutation capabilities of MAX-2's PERMUTE instruction to 8-bit subwords selected from two 128-bit source registers, into a single 128-bit destination register. Since there are 32 such subwords from which 16 are selected, this requires 16*1g32=80 bits for specifying the desired permutation. This means that VPERM has to use another 128-bit register to hold the permutation control bits, making it a very expensive instruction with three source registers and one destination register, all 128 bits wide.

It is desirable to provide significantly faster and more economical ways to perform arbitrary permutations of n bits, without any need for table storage, which can be used for encrypting large amounts of data for confidentiality or privacy.

SUMMARY OF THE INVENTION

The present invention provides permutation instructions which can be used in software executed in a programmable processor for solving permutation problems in cryptography, multimedia and other applications. For fast cryptography, bit-level permutations are used, whereas for multimedia, permutations on subwords of typically 8 bits or 16 bits are used. Permutation instructions of the present invention can be used to provide any arbitrary permutation of sixty-four 1-bit subwords in a 64-bit processor, i.e., a processor with 64-bit words, registers and datapaths, for use in fast cryptography. The permutation instructions of the present invention can also be used for permuting subwords greater than 1 bit in size, for use in fast multimedia processing. For example, in addition to being able to permute sixty-four 1-bit subwords in a register, the permutation instructions and underlying functional unit can permute thirty-two 2-bit subwords, sixteen 4-bit subwords, eight 8-bit subwords, four 16-bit subwords, or two 32-bit subwords. The permutation instructions of the present invention can be added as new instructions to the Instruction Set Architecture of a conventional microprocessor, or they can be used in the design of new processors or coprocessors to be efficient for both cryptography and multimedia software.

A PPERM instruction is defined to perform permutations by a sequence of instructions with each sequence specifying the position in the source for each bit in the destination. In the PPERM instruction bits in the destination register that change are updated and bits in the destination register that do not change are set to zero. Alternatively, a PPERM3R instruction is defined to perform permutations. The PPERM3R instruction is similar to the PPERM instruction except that the bits from the destination register which do not change are copied unchanged, rather than set to zero as in PPERM. Accordingly, the PPERM3R instruction uses three source registers because the destination register is also a source register since the unchanged bits are held in the destination register. For every one of n bits to be changed in the final permutation, 1gn bits can be used in the PPERM instruction or the PPERM3R instruction to specify which bit in the source register should replace the bit to be changed in the destination register.

In an alternate embodiment, a GRP instruction is defined to perform permutations. The GRP instruction divides the initial sequence in the source register into two groups depending on configuration bits. The first group is concatenated with the second group to form the result of one GRP instruction, which is also an intermediate bit sequence toward the final permutation. The total number of GRP instructions for a permutation of n bits is up to 1gn.

In an embodiment of the present invention, multibit subwords are permuted with the GRP instruction. In a further embodiment of the invention, the method and system are scaled for performing permutations of 2n bits in which subwords are packed into two or more registers. In this embodiment, at most 21gn+4 instructions are used to permute 2n bits using n-bit words.

For a better understanding of the present invention, reference may be made to the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic diagram of a system for implementing permutation instructions in accordance with an embodiment of the present invention.

FIG. 2 is a flow diagram of a method for determining a permutation instruction sequence to achieve a desired permutation in accordance with an embodiment of the present invention.

FIG. 3A is a schematic diagram of operation of a PPERM instruction.

FIG. 3B is a schematic diagram of an example extracting 8 bits from multiple registers with PPERM instructions with “otherreg” bit.

FIG. 4A illustrates a schematic diagram of an alternate system with three source registers.

FIG. 4B is a schematic diagram of a circuit for implementing a 64-bit PPERM instruction.

FIG. 5 is a schematic diagram of an operation of a GRP instruction.

FIG. 6 is a schematic diagram of a method for determining a sequence of GRP instruction and control bits for the GRP instructions.

FIG. 7 is an example of determining a GRP instruction sequence for an 8-bit permutation.

FIG. 8A is a schematic diagram of a unit for serial implementation of a GRP operation with one control signal.

FIG. 8B is a circuit diagram for a unit for a GRP operation with one control signal.

FIG. 8C is a schematic diagram of an alternate unit for serial implementation of a GRP operation with two control signals.

FIG. 8D is a circuit diagram for a unit for a GRP operation with two control signals.

FIG. 9A is an example of a circuit for serial implementation of a first step of a GRP operation using half of a GRP function unit.

FIG. 9B is an example of a whole 8-bit GRP function unit.

FIG. 10 is a circuit diagram of a serial implementation of a GRP operation.

FIG. 11 is a schematic diagram of principle for a parallel scheme for a GRP operation.

FIG. 12 is a schematic diagram of a unit for parallel implementation of a GRP operation.

FIG. 13 is a circuit diagram for extracting z bits in an 8-bit group by combining z bits in two 4-bit groups.

FIG. 14 is a circuit diagram of addition of two one-hot encoded numbers.

FIG. 15 is a circuit diagram of a circuit to generate a final result of an n bit GRP operation, wherein n=4.

FIG. 16 is a schematic diagram of a parallel GRP implementation.

FIG. 17 is a schematic diagram of a module for generating select signals.

FIG. 18A is a flow diagram of a method for 2n-bit permutation in accordance with an embodiment of the present invention.

FIG. 18B is a schematic diagram of the method shown in 18A.

FIG. 19 is a graph of the number of instructions for encryption and key generation in DES.

FIG. 20 is a circuit diagram for extracting z bits in an 8-bit group by combining z bits in two 4-bit groups and making non-z bits zero.

FIG. 21 is a schematic diagram of an embodiment of a parallel implementation of 8-bit GRP operation.

FIG. 22 is a schematic diagram of an embodiment of a parallel implementation of 64-bit GRP operation.

FIG. 23 is a schematic diagram of an embodiment of a module for generating select signals.

DETAILED DESCRIPTION

Reference will now be made in greater detail to a preferred embodiment of the invention, an example of which is illustrated in the accompanying drawings. Wherever possible, the same reference numerals will be used throughout the drawings and the description to refer to the same or like parts.

FIG. 1 illustrates a schematic diagram of a system 10 for implementing efficient permutation instructions in accordance with the teachings of the present invention. Register file 12 includes source register 11 a, source register 11 b and destination register 11 c. System 10 can provide bit-level permutations of all n bits of any register in register file 12. The same solution can be applied to different subword sizes of 2^(i) bits, for i=0, 1, 2, . . . , m, where n=2^(m) bits. For a fixed word size of n bits, and 1-bit subwords, there are n subwords to be permuted. Source register values to be permuted 13 from register 11 a and configuration bits 15 from source register 11 b are applied over data paths to permutation functional unit 14. Permutation function unit 14 generates permutation result 16. Permutation result 16 can be an intermediate result if additional permutations are performed by permutation functional unit 14. For other instructions, arithmetic logic unit (ALU) 17 and shifter 18 receive source register values 13 from source register 11 a and source register values 15 from source register 11 b and generate respective ALU result 20 and shifter result 21 over a data path to destination register 11 c. System 10 can be implemented in any programmable processor, for example, a conventional microprocessor, digital signal processor (DSP), cryptographic processor, multimedia processor, media processor, programmable system-on-a-chip (SOC), and can be used in developing processors or coprocessors for providing cryptography, multimedia and other operations.

FIG. 2 is a flow diagram of a method of determining permutation instruction sequences for permutations 22. The determined permutation instruction sequences can be executed in permutation functional unit 14. In block 23, bit positions in a source sequence of bits are defined for a group of bits in a destination register. In block 24, a permutation instruction is determined with the bit positions to assemble bits from the source sequence of bits. In block 25, the permutation instruction is performed. The assembled bits are inserted into a destination register as determined by the bit positions. Blocks 23-25 can be conditionally repeated for every non-overlapping group of bits in the destination, in block 26. After the final permutation is determined, the desired permutation of the source register is determined in block 27. Alternatively, all block 23 can be performed for all bits in the destination register and block 24 is performed for all bit positions determined in block 23. Thereafter when the permutation needs to be performed, block 25 is performed. All permutation instructions can be performed in block 25 in parallel.

A PPERM instruction can be used as the permutation instruction described above for dynamically specified permutations of n subwords. Each PPERM instruction defines a subset of bits which subsets can be combined to define the desired permutation. The source positions for k bits can be specified with one instruction. PPERM instructions can be defined as follows: PPERM,x R1, R2, R3 wherein R1 and R2 are the source registers and R3 is a destination register. R1 contains the bits to be permuted. R2 contains configuration bits. x specifies which k bits in R3 will change. In R3, only k bits specified by x are updated, the other bits are set to zero. k1gn bits in R2 can be used to specify where to extract the k consecutive bits to be changed in R3.

FIG. 3A illustrates a schematic diagram of an example operation of the PPERM instruction. The PPERM instruction is PPERM,1 R1, R2, R3 wherein R2 is 0x020E160820252C33 in hexadecimal notation. This is the same as the decimal values shown in R2 as (2, 14, 22, 8, 32, 37, 44, 51). Configuration bits of register R2 can be applied with source bits to be permuted of register R1 to a 64-8 crossbar 30. 64-8 crossbar 30 assembles bits from R1 according to configuration bits of R2 into assembled bits 32. Assembled bits 32 are inserted in R3 at byte 1 as determined by x. In this embodiment, 8 bits are permuted each time, and 56 bits are set to zero.

In order to store the position information in one register, the following inequality should hold

$\begin{matrix} {{{k\mspace{11mu}\lg\mspace{11mu} n} \leq n}{{Therefore},}} & (1) \\ {k \leq \frac{n}{\lg\mspace{11mu} n}} & (2) \end{matrix}$

Approximately n/1gn bits can be specified with one instruction. In total, n/k PPERM instructions which is approximately equivalent to 1 g n PPERM instructions are used for an n-bit permutation. For example, when n=64, k=8 is selected. Eight PPERM instructions for a 64-bit permutation are used, and seven OR instructions to merge these results to get the desired permutation. For every one of the k bits to be copied in the final permutation, 1gn bits are used to specify which bit in the source register should be copied.

The PPERM instruction is scalable to multiple n bits wherein subwords are packed in more than one register. To allow PPERM to permute bits from more than one source register, an extra bit (denoted “otherreg”) is used to select each bit in the source register. Accordingly, different PPERM instructions can pick bits from more than one register. In this embodiment, for n=64 bits, each index into the source register is (1gn+1)=7 bits. If the “otherreg” bit=0, then the remaining 6-bit index selects a bit in the source register to place in the destination register, as described above. If the “otherreg” bit=1, the corresponding bit in the destination register is forced to zero. The pseudo code for the operation performed by PPERM instructions on 64-bit architecture is shown in Table 1.

TABLE 1 Instruction Pseudo code PPERM,x R1, R2, R3 R3[0..n−1] = 0; for (i = 0; i < k; i ++)  otherreg = R2[i*(lg(n)+1)];  j = R2[i*(lg(n)+1)+1 .. ((i+1)*(lg(n)+1)−1];  if (otherreg == 0)   R3[x*k+i]= R1[j];

To permute 2n bits, two source registers must be used, and two destination registers are produced. For each destination register, 8 PPERM instructions are used on each source register, requiring a total of 16 PPERM instructions and 15 OR instructions to combine the results into one destination register. The same must be repeated to produce the other destination register. Hence, a total of 2(16+15)=62 instructions are needed to permute 2n bits.

The PPERM instruction with the “otherreg” bit can permute more than 2n bits stored in multiple registers. In FIG. 3B, the 8 bits to be collected in register R1 can come from 5 different source registers R11, R12, R13, R14 and R15. In this example the bits collected are: bit 2 from R11, bit 14 from R12, bit 22 from R13, bit 8 from R14, and bit 32, bit 37, bit 44 and bit 51 from R15. Registers R21, R22, R23, R24 and R25 are used for storing configuration bits. 8 configuration bits are used to select one data bit from one of registers R11, R12, R13, R14 or R15. The lower 6 bits are the position of selected bits in source registers, shown as the lower rwo of numbers in the configuration registers in FIG. 3B. The most significant bit is the “otherreg” bit, shown as the upper row of numbers in FIG. 3B. The PPERM instructions shown in Table 1.1 can be used to collect the desired 8 bits from the 5 data registers R11, R12, R13, R14 and R15. In each of instructions 1, 2, 3 and 4, only one bit is extracted to R1, R2, R3, and R4 because only one index in each of the configuration bits has a 0 “otherreg” bit. For example, in R21, only 02 has 0 in “otherreg” bit. In R22, only 0E has 0 in “otherreg” bit. Instruction 5 puts 4 bits in R5 because 4 indices have 0 in their “otherreg” bit. Thereafter, the desired 8 bits are merged in R1 with OR instructions.

TABLE 1.1 ;  0x02 0E 16 08 20 25 2C 33 1: PPERM,2 R11, R21, R1 ;R21=0x02 80 80 80 80 80 80 80 2: PPERM,2 R12, R22, R2 ;R22=0x80 0E 80 80 80 80 80 80 3: PPERM,2 R13, R23, R3 ;R23=0x80 80 16 80 80 80 80 80 4: PPERM,2 R14, R24, R4 ;R24=0x80 80 80 08 80 80 80 80 5: PPERM,2 R15, R25, R5 ;R25=0x80 80 80 80 20 25 2C 33 6: OR R1, R2, R1 7: OR R3, R4, R3 8: OR R1, R5, R1 9: OR R1, R3, R1

In an alternate embodiment, the number of configuration registers are reduced. An additional parameter can be used in the PPERM instruction such that the PPERM instruction can be defined as: PPERM,x,regid R1, R2, R3 wherein R1 and R2 are the source registers and R3 is a destination register. R1 contains a subset of the bits to be permuted. x specifies which k bits in R3 are changed by copying bits from the source register. Regid specifies which subset of bits are stored in R1. The configuration register R2 contains the index of the bit to be copied, and a srcid field, for each of the k bits. In R3, a bit is copied if it is one of the k bits specified by x and its “srcid” is equal to the “regid” encoded in the instruction. Otherwise, this bit in R3 is set to zero. “regid” and “srcid” can be any reasonable size, but both “regid” and “scrid” must contain the same number of bits. If regid and srcid have m bits, k(1gn+m) bits in R2 are used to specify where to extract the k bits and from which register. If m=0, the “PPERM,x,regid” instruction is reduced back to the above-described “PPERM,x” instruction.

For example, the PPERM instructions shown in Table 1.2 can be used for reducing the number of configuration registers used in the previous example, shown in Table 1.1. 8 bits are used to specify the location for each selected bit. The lower 6 bits are the bit position in the source register and higher 2 bits are “srcid”. 2 configuration registers are used. Instruction 1 grabs one bit because only 02's srcid 0 matches the regid=0 of instruction 1. Instruction 2 grabs one bit because only 4E's srcid 1 matches the regid=1 of instruction 2. Instruction 3 grabs one bit because only D6's srcid 3 matches the regid=3 of instruction 3. Instruction 4 grabs one bit because only 48's srcid 1 matches the regid=1 of instruction 4. Notice that instruction 4 uses a different configuration register 25 than the configuration register 21 used by the first 3 instructions. This allows more than 4 source registers to be used to supply bits to be permuted. Instruction 5 grabs 4 bits because the srcid 0 of bit 20, bit 25, bit 2C and bit 33 all match the regid=0 of instruction 5.

In this embodiment, only one configuration register is needed, if the data bits to be permuted are stored in at most 4 source registers. This is because 8 data bits are permuted in one PPERM instruction, each data bit requiring 6 configuration bits to specify its positional location in a source register, so only 2 configuration bits are left to specify a source register. If two configuration registers are used, then the data bits to be permuted can be stored in at most 8 registers, and so forth.

TABLE 1.2 ;  0x02 0E 16 08 20 25 2C 33 1: PPERM,2,0 R11, R21, R1 ;R21=0x02 4E D6 80 80 80 80 80 ;srcid:0 1 3 2 2 2 2 2 2: PPERM,2,1 R12, R21, R2 ;R21=0x02 4E D6 80 80 80 80 80 ;srcid:0 1 3 2 2 2 2 2 3: PPERM,2,3 R13, R21, R3 ;R21=0x02 4E D6 80 80 80 80 80 ;srcid:0 1 3 2 2 2 2 2 4: PPERM,2,1 R14, R25, R4 ;R25=0x80 80 80 48 20 25 2C 33 ;srcid:2 2 2 1 0 0 0 0 5: PPERM,2,0 R15, R25, R5 ;R25=0x80 80 80 48 20 25 2C 33 ;srcid:2 2 2 1 0 0 0 0 6: OR R1, R2, R1 7: OR R3, R4, R3 8: OR R1, R5, R1 9: OR R1, R3, R1

FIG. 4A illustrates a schematic diagram of an alternate embodiment of system 100 with 3 source registers rather than two. Register file 112 includes source register 111 a, source register 111 b, source register 111 d and destination register 111 c. System 100 can provide bit-level permutations of all n bits of any register in register file 112. Source register values to be permuted 113 from register 111 a and configuration bits 115 from source register 111 b and intermediate result 122 from source register 111 d are applied over data paths to permutation functional unit 114. Permutation function unit 114 generates permutation result 116 which is written back to destination register 111 c. PPERM3R instructions are defined on system 100 to perform any n-bit permutation. The PPERM3R instruction can be defined as follows: PPERM3R,x R1, R2, R3 R1 and R2 are source registers, and R3 is a destination register. R1 contains the bits to be permuted. R2 contains the configuration bits. x specifies which k bits in R3 will change. In R3, only k bits specified by x are updated, the other bits are copied from R3 unchanged. The R3 destination register must also be a source register because the unchanged bits must be copied from R3 (used as a source register) to R3 (used as a destination register). The PPERM3R instruction is similar to the PPPERM instruction described above, except in the PPERM3R instructions three source registers are used.

PPERM3R does not use the OR instructions used to accumulate the intermediate results produced by each PPERM instruction. For example, if 8 PPERM instructions are performed to permute 64 bits, then 7 OR instructions are used to accumulate the final permuted result, as described previously. To achieve the same permutation, 8 PPERM3R instructions are used, since the partial result can be accumulated with each PPERM3R instruction. Accordingly, system 100 for PPERM3R requires 3 source registers, whereas system 10 for PPERM3 requires only 2 source registers.

The following codes in Table 2 give an example of PPERM3R instruction which can be used to do an initial permutation in the data encryption standard (DES). All registers are 64 bits in width. R1 is the source and R2 is the target register. R10 through R17 are registers containing permutation configuration bits. 6 of 8 bits are used to represent the position of each bit in the source register. Each PPERM3R instruction produces an intermediate state with 8 bits permuted. 8 instructions are required to permute all 64 bits. For example, the first byte in R10, 0x39 (in hexadecimal notation), indicates that the first bit in the target register R2 is bit 57 (in decimal notation) in the source register R1.

TABLE 2 PPERM3R,0 R1, R10, R2 ; R10 = 0x3931292119110901 PPERM3R,1 R1, R11, R2 ; R11 = 0x3B332B231B130B03 PPERM3R,2 R1, R12, R2 ; R12 = 0x3D352D251D150D05 PPERM3R,3 R1, R13, R2 ; R13 = 0x3F372F271F170F07 PPERM3R,4 R1, R14, R2 ; R14 = 0x3830282018100800 PPERM3R,5 R1, R15, R2 ; R15 = 0x3A322A221A120A02 PPERM3R,6 R1, R16, R2 ; R16 = 0x3C342C241C140C04 PPERM3R,7 R1, R17, R2 ; R17 = 0x3E362E261E160E06

The PPERM3R instruction is scalable to multiple n bits wherein bits are packed in more than one register. To allow PPERM3R to permute bits from more than one source register, an extra bit (denoted “otherreg”) is used to select each bit in the source register. Accordingly, different PPERM3R instructions can pick bits from more than one register. In this embodiment, for n=64 bits, each index into the source register is (1gn+1)=7 bits. If the “otherreg” bit=0, then the remaining 6-bit index selects a bit in the source register to place in the destination register, as described above. If the “otherreg” bit=1, the corresponding bit in the destination register R3 is left unchanged.

In an alternate embodiment, the number of configuration registers are reduced. An additional parameter can be used in the PPERM3R instruction such that the PPERM3R instruction can be defined as: PPERM3R,x,regid R1, R2, R3 wherein R1 and R2 are the source registers and R3 is a destination register. R1 contains a subset of the bits to be permuted. x specifies which k bits in R3 are changed by copying bits from the source register R1. Regid specifies which subset of bits are stored in R1. The configuration register R2 contains the index of the bit to be copied, and a srcid field, for each of the k bits. In R3, a bit is copied if it is one of the k bits specified by x and its “srcid” is equal to the “regid” encoded in the instruction. Otherwise, this bit in R3 is copied unchanged from its previous value in R3. This means that R3 is both a destination register and a source register for instruction PPREM3R. “regid” and “srcid” can be of any reasonable size, but both “regid” and “scrid” must contain the same number of bits. If regid and srcid have m bits, k(1gn+m) bits in R2 are used to specify where to extract the k bits and from which register. If m=0, the “PPERM3R,x,regid” instruction is reduced back to the above-described “PPERM3R,x” instruction.

Both PPERM and PPERM3R instruction can be used for permutations with repetitions. These are permutations where some bits are repeated, and other bits are omitted. For example the PPERM3R instruction can be used in DES for expansion from 32 bits to 48 bits in which some of the bits are replicated.

FIG. 4B illustrates a circuit diagram for the implementation of the 64-bit PPERM instruction. The upper part of 33 is a 64-to-8 crossbar 30. There are 8 columns in crossbar 30 for permuting 8 bits each time. The output of crossbar 30 is merged with zeros using eight multiplexer groups 34, each of which has eight 2-1 multiplexers. Each multiplexer group in 34 can replace 8 consecutive bits at byte boundaries in the intermediate result with the newly-generated value. The 56 bits that are not replaced with this newly-generated 8-bit value are set to zero for PPERM. The PPERM3R instruction can be implemented as the same circuit, except that the 56 bits that are not replaced with this newly-generated 8-bit value are copied unchanged from the destination register R3.

In an alternate embodiment using system 10 of FIG. 1A, a GRP instruction can be used to perform arbitrary n-bit permutations. An arbitrary n-bit permutation is any one of the n! possible permutations of n objects. Each GRP instruction divides bits into two groups and a sequence of GRP instructions can be used to perform the desired permutation. The GRP instruction can be defined as follows: GRP R1, R2, R3 wherein R1 and R2 are the source registers, and R3 is the destination register. R1 contains the bits to be permuted. R2 contains the control bits. The operation of a GRP instruction is shown as pseudo code in Table 3.

TABLE 3 Instruction Pseudo code GRP R1, R2, R3 j = 0; for (i = 0; i < n; i ++)  if (R2[i] == 0)   R3[j ++] = R1[i]; for (i = 0; i < n; i ++)  if (R2[i] == 1)   R3[j ++] = R1[i];

The GRP instruction divides the bits in the source register R1 into two groups according to control bits in register R2. For each bit in register R1, the corresponding bit in register R2 is checked. If the bit in register R2 is 0, the corresponding bit in register R1 is placed into a first group. If the bit in register R2 is 1, the corresponding bit in register R1 is placed into a second group. During this process, the relative positions of bits within each group do not change. The first group is put to the left of the second group to obtain the result value in R3.

FIG. 5 is a schematic diagram of operation of a GRP instruction for performing an 8-bit permutation. (Here n=8 bits). Bits in register R1 are represented by bit a, bit b, bit c, bit d, bit e, bit f, bit g, and bit h. The control bits in register R2 are 10011010. Each of bits b, c, f and h has a corresponding control bit of 0 and these bits are put in the first group. Each of bits a, d, e and g has a corresponding control bit of 1 and these bits are put in the second group.

A method for determining a sequence of GRP instructions 40 and control bits for the GRP instructions is illustrated in FIG. 6. In block 41, an arrangement is determined for a permutation to be performed. In this description “permutation” is used to represent the transformation performed on a sequence of bits and “arrangement” is used to represent the order of bits in a sequence. Accordingly, each permutation operation takes an arrangement as input and produces another arrangement. The permutation determines the relationship between the initial arrangement and the final arrangement. The input is referred to as the initial arrangement, and the output is referred to as the final arrangement. On an n-bit architecture, any n-bit permutations can be performed with no more than 1gn GRP instructions.

An integer sequence can be used to represent a desired permutation, called the final arrangement, in block 41. An integer in the sequence denotes the position in the initial arrangement of the bit in the final arrangement. For example, in an 8-bit permutation, the integer sequence (1, 2, 5, 7, 0, 3, 6, 4), which represents an arrangement, indicates that bit 0 in this arrangement is bit 1 in the initial arrangement. Similarly, bit 1 in this arrangement is bit 2 initially; bit 2 is bit 5 initially, and so forth. In an identity permutation, the final arrangement can be represented with a sequence (0, 1, 2, 3, 4, 5, 6, 7), which indicates that the bits in this arrangement come from the same positions as in the initial arrangement. Since the n-bit initial arrangement can always be represented as (0, 1, 2, . . . , n−1,n), the integer sequence for the final arrangement is used to represent a permutation.

In block 42, the number of monotonically increasing sequences in the arrangement is determined. A monotonically increasing sequence can be defined as follows: in an integer sequence b₁, b₂, . . . , b_(i), . . . b_(j), . . , b_(n), its subsequence b_(i), . . . , b_(j) is a monotonically increasing sequence (MIS) if b_(i)<b_(i+1)<b_(i+2)< . . . <b_(j), b_(i−1)>b_(i) or i=1, b_(j)>b_(j+1) or j=n. For example, given a sequence (1, 2, 5, 7, 0, 3, 6, 4), the following MISes are found: (1, 2, 5, 7), (0, 3, 6), and (4). Any integer sequence can be considered a concatenation of a number of non-overlapping MISes.

In block 43, groups of MISes in the arrangement are combined. For example, the MISes can be divided into a left half and right half. The MISes of the left half are combined with the MISes of the righthalf. For example, the first MIS in the left half is combined with the first MIS in the right half. The second MIS in the left half is combined with the second MIS in the right half and the like.

In block 44, the merged groups are sorted in increasing order. In block 45, an intermediate arrangement is determined by combining the sorted results of the merged groups. In block 46, control bits are determined from the intermediate arrangement. For example, if the number in the intermediate arrangement is in the right half in block 43 the control bit is set to 1 and if the number in the intermediate arrangement is in the left half in block 43 the control bit is set to 0. In block 47, it is determined if the intermediate arrangement is a single monotonically increasing sequence which represents the original input and is the initial arrangement. If the intermediate arrangement is the initial arrangement the GRP instruction sequence can be determined in block 48 using the control bits generated in block 46. If the intermediate arrangement is not the initial arrangement blocks 42-47 are repeated.

FIG. 7 is an example of determining the GRP instruction sequence for an 8-bit permutation as described in method 40, the initial arrangement and final arrangement of the 8-bit permutation is determined as (0, 1, 2, 3, 4, 5, 6, 7) and (5, 0, 1, 2, 4, 3, 7, 6) by performing block 41. Accordingly bit 5 in the initial arrangement becomes bit 0 in the final arrangement, bit 0 in the initial arrangement becomes bit 1 of the final arrangement, bit 1 in the initial arrangement becomes bit 2 in the final arrangement, bit 2 in the initial arrangement becomes bit 3 in the final arrangement, bit 4 in the initial arrangement becomes bit 4 in the final arrangement, bit 3 in the initial arrangement becomes bit 5 in the final arrangement, bit 7 in the initial arrangement becomes bit 6 in the final arrangement, and bit 6 in the initial arrangement becomes bit 7 in the final arrangement. At the beginning of iteration 1 as shown in column 50, P is the final arrangement of the permutation to be performed as shown in row 52. The integer sequence is divided into monotonically increasing sequences (MIS), as shown in row 53 by performing block 42. In row 53, underlined MISes are the right half and non-underlined MISes are the left half. The MISes in the left and right halves are combined in row 54 by performing block 43. The merged groups are sorted in row 55 by performing block 44. Results of sorting are shown in the intermediate arrangement shown in row 56 by performing block 45. This is an intermediate arrangement, which is “closer” to the desired final arrangement than the initial arrangement. The control bits for one GRP instruction can be determined by examining the numbers in this intermediate arrangement in row 57 by performing block 46. Accordingly, for iteration 1 the values of bits 0, 2 and 7 in the intermediate arrangement were in the right half and are assigned a control bit value of 1 and bits 1, 3, 4, 5 and 6 in the intermediate arrangement were in the left half and are assigned a control bit value of 0. The iteration is repeated in column 51 with the new intermediate arrangement (3, 5, 7, 0, 1, 2, 4, 6). The process terminates when the newly generated arrangement is a single monotonically increasing sequence (0, 1, 2, . . . , n−2, n−1), which represents the original input as shown in row 56 in column 51. Using the control bits generated in this process, the permutation can be performed with the following sequence of GRP instructions determined from block 48:

GRP R1,R2,R1 ;R2=0b11101010 GRP R1,R3,R1 ;R3=0b10100001 wherein R2 and R3 contain the control bits which were generated in iteration 2 and iteration 1, respectively.

NumMIS is defined as a function that takes an integer sequence as input and returns the number of MISes in the integer sequence. For example, numMIS(1, 2, 5, 7, 0, 3, 6, 4)=3; numMIS(1, 2, 3, 4)=1; numMIS(1, 3, 2, 4)=2; and numMIS(4, 3, 2, 1)=4. The maximum value of numMIS is the length of the input sequence. The numMIS value of an arrangement is the value of the numMIS function when it takes as input the integer sequence representation of the arrangement. For an n-bit permutation, the numMIS value of the final arrangement can not exceed n. The numMIS value of the initial arrangement is always 1.

NumMIS(P) can be used to represent the numMIS value of arrangement P. Given an arrangement P, if numMIS(P)=k (k>1), there exists an arrangement Q, such that numMIS(Q)=┌k/2┐, and P can be generated from Q with one GRP instruction. ┌k/2┐ denotes the least integer not less than k/2.

From the above description, any arbitrary permutations of n bits can be performed with the GRP instruction. For example, in a case where n=8. An arrangement of 8 bits, which is the final arrangement of an 8-bit permutation: P_(d)=(7, 6, 5, 4, 3, 2, 0, 1) and numMIS(P_(d))=7. An arrangement P_(c) and an instruction I_(c), can be found such that numMIS(P_(c))=4 and I_(c) generates P_(d) from P_(c). Similarly, we can find arrangements P_(b) and P_(a), instructions I_(b) and I_(a), such that I_(b) generates P_(c) from P_(b) and numMIS(P_(b))=2. Similarly, I_(a) generates P_(b) from P_(a) and numMIS(P_(a))=1. Since numMIS(P_(a))=1, P_(a) is the initial arrangement. Accordingly, instruction sequence I_(a), I_(b), and I_(c) can be used to perform the permutation corresponding to P_(d). Algorithm 1 shown in Table 4 can be used to find Q and the GRP instruction that generates P from Q.

TABLE 4  Algorithm 1: To generate one GRP instruction and the arrangement Q  INPUT:   Arrangement P  OUTPUT:  Arrangement Q and control bits c for GRP instruction  Let P_(i) represent the i(th) MIS in P. (x, y) denotes the operations that  combine integer sequence x and y into a longer sequence. Sort(x) is a  function that sorts elements in sequence x in increasing order. P can be  represented by k MISes as follows:     P = (P₁, P₂, P₃, ..., P_(m), P_(m+1) , P_(m+2) ...,P_(k−1), P_(k))  Note that m= ┌k/2┐, and P₁, P₂, P₃, ..., P_(m) is the first half MISes. 1. Generate temporary sequences T₁, T₂,...,T_(m):   For i = 1, 2, ... ,m−1      T_(i) = (P_(i) , P_(i+m))   If (k is odd) then    T_(m) = P_(m)   else    T_(m)=(P_(m) , P_(k)) 2. Generate Q:   For i = 1, 2, ... , m    Q_(i)= Sort(T_(i))   Let Q = (Q₁, Q₂, Q₃,...,Q_(m)). 3. Generate control bits c:   Q can also be considered as a bit string:   Q = (Q₁, Q₂, Q₃,...,Q_(m)) = (b₀, b₁, b₂, ...,b_(n−1))   For j = 0, 1, ... , n−1    if (b_(j) is in P₁, P₂, P₃, ... , or P_(m))     c_(j) = 0    else     c_(j) = 1 If R1 and R2 contain Q and c, respectively, P will be in R3 after executing the following instruction: GRP R1, R2, R3

Algorithm 2 generates the GRP instruction sequence for a permutation as shown in Table 5. In Algorithm 2, starting from the final arrangement, Algorithm 1 is repeatedly invoked to search some temporary arrangements that have a lower numMIS value until we get an arrangement whose numMIS value is 1. At the same time, the control bits generated in Algorithm 1 are stored in an array aC. Every time Algorithm 1 is called arrangement P is reduced.

The process terminates when an arrangement Q is formed having numMIS value of 1, which means it is the initial arrangement.

TABLE 5 Algorithm 2: To generate sequence of GRP instructions for a permutation INPUT: The final arrangement of a permutation P OUPUT: aC: an array that stores the control bits for the GRP instructions that perform the permutation num_instr: the number of valid entries in aC 1. num_instr = 0; 2. If (numMIS(P) == 1) return; 3. Call Algorithm 1 with P, and put the results of Algorithm 1 in Q and tmp_c. 4. aC[num_instr ++] = tmp_c; 5. P = Q; 6. Goto step 2.

Every time a new arrangement is generated, its numMIS value decreases by half. The maximum numMIS value of the final arrangement is its length n. Accordingly, at most 1g(n) steps are needed to reduce the numMIS value of arrangements from n to 1. Thus, the number of iterations in Algorithm 2 does not exceed 1gn and the number of valid entries in the returned array aC does not exceed 1gn. For each entry in aC, one GRP instruction is generated. The total number of GRP instructions does not exceed 1gn. Accordingly, 1g8=3 GRP instructions are sufficient to permute 8 bits.

The permutation P, can be performed by starting from the initial arrangement whose numMIS value is 1. Using the control bits kept in array aC from entry (num-instr-1) to entry 0, temporary arrangements are generated in the reverse order, until the final arrangement is achieved after the last GRP instruction.

The generated sequence of permutation instruction does not have to be contiguous in memory and does not have to be executed contiguously in time as long as the order of the instructions in the sequence is preserved. Accordingly, other instructions can be interspersed with the sequence of permutation instructions if the registers used for the permutation instruction are unchanged.

For example, in Table 7 below a sequence of 3 GRP instructions use only registers R1, R2, R3 and R4. Since the first instruction uses only registers R1 and R2, and the second register uses only registers R1 and R3, an instruction such as ADD R8, R1, R12 which adds the values of the contents of register R8 and regsiter R1, writing the result into register R12, can be executed between the first two GRP instructions, without affecting the result of this sequence of 3 GRP instructions. ADD can read and use the values of any of registers R1, R2, R3 and R4, as long as it does not write R1, and does not change the expected values in configuration register R3 before it is used by the second GRP instruction, and the configuration value R4 before it is used by the third GRP instruction.

Table 6 illustrates an implementation of algorithm 1 for the 8-bit permutation (7, 6, 5, 4, 3, 2, 0, 1).

TABLE 6 Iteration 1 2 3 P (7,6,5,4,3,2,0,1) (3,7,2,6,0,1,5,4) (0,1,3,5,7,2,4,6) MISes in P (7)(6)(5)(4) (3)(2)(0)(1) (3,7)(2,6) (0,1,5)(4) (0,1,3,5,7) (2,4,6) After Alg. 1, step 1 (7,3)(6,2)(5,0,1)(4) (3,7,0,1,5)(2,6,4) (0,1,3,5,7,2,4,6) After Alg. 1, step 2 Q=(3,7)(2,6)(0,1,5)(4) Q=(0,1,3,5,7)(2,4,6) (0,1,2,3,4,5,6,7) After Alg. 1 step 3 c=10101100 c=11010010 c=00101010

Accordingly, the permutation can be performed with the instruction sequence shown in Table 7.

TABLE 7 GRP R1, R2, R1 ; R2 = 00101010 kept in aC[2] GRP R1, R3, R1 ; R3 = 11010010 kept in aC[1] GRP R1, R4, R1 ; R4 = 10101100 kept in aC[0]

FIGS. 8A and 8B illustrate a unit of one implementation of the GRP operation. Each unit 60 has five legs: two inputs 61 a and 61 b, two outputs 62 x and 62 y, and one control signal 63 c. Inputs 61 a and 61 b are connected, such that input signals are applied only to one of 61 a or 61 b at any time. When control signal 63 c is 0, output 62 y is connected to input 61 a and 61 b. When 63 c is 1, output 62 x is connected to input 61 a and input 61 b. Unit 60 can be implemented with four transistors and an inverter, as shown in FIG. 8B. If many units use the same control signal, the inverter can be removed by generating control signal c′ outside and feeding it to units 60, as shown in FIG. 8C and 8D.

A matrix to perform the GRP operation can be formed of basic unit 60. An 8-bit GRP function unit is built as an example, as shown in FIGS. 9A and 9B. The GRP operation unit can be used to perform the GRP instruction described above. It will be appreciated that one with ordinary skills in the art could use the teachings of the present invention to implement a 64-bit unit. A GRP operation can be divided into three steps. The first step is to pick up input bits whose corresponding control bit is 0. These bits are referred to as z bits for convenience. The second step is to pick up input bits whose corresponding control bit is 1. These bits are referred to as o bits. In the third step, the results of two steps are merged to get the result of the whole GRP instruction. FIG. 9A illustrates a representative example of an implementation of the first step using a half of GRP function unit 68. The z bits in the input, whose corresponding control bit is 0, are picked up and put into consecutive bits starting at the left end of the output. The control bits for this GRP instruction are (C₀, C₁, . . . , C₇). Inputs are (I₀, I₁, . . . , I₇). Outputs are (O₀, O₁, . . , O₇).

In the first step of GRP operation, the basic units 60 in Row₀ separate input bits with control bit 1 from input bits with control bit 0. Only for bits whose control bit is 0 will output reach Row₁. If all control bits are 0, all basic units 60 connect the input with leg output 62 y such that I₀, I₁, . . . , and I₇ go all the way down vertically. For example, I₀ goes to O₀. I₁ goes to O₁, and the like. The output is the same as the input. Alternatively, if all control bits are 1, all inputs of basic units 60 are blocked in Row₀. Accordingly, all outputs are disconnected. When control bits are the mixture of 0's and 1's, input I_(x) is blocked at Row₀ if C_(x) is 1. Alternatively, I_(x) goes to O_(y) where y is the number of 0's in C₀ . . . C_(x−1) because for each 1 in C₀, C₁, . . . , C_(x−1), I_(x) goes left one column (according to the function of basic units). There are x-y 1's in C₀, C₁, . . . , C_(x−1), so I_(x) will appear at O_(x-(x-y)), i.e. O_(y). If there is no 0 to the left of C_(x), I_(x) goes to I₀. If there are one 0 to the left of C_(x), then there are (x−1) 1's to the left of C_(x). I_(x) goes to O₁; and the like.

The second step of the GRP operation can be done by inverting the control bits, such that performing the first step with inverted control bits does the second step. For k 0's in the control bits, only O₀o to O_(k−1) are connected to the input. Other output lines are disconnected. The third step can be performed by wiring together the output of the first two steps. A whole 8-bit GRP function unit 70 can be implemented as shown in FIG. 9B. On n-bit system, if there are k 0's in the control bits, k z bit, O₀, . . . , O_(k−1), get values from the upper half 71 and n-k o bits O_(k), . . . , O_(n−1) get values from the lower half 72.

FIG. 10 illustrates an alternative embodiment to reduce the area by using different placement in a serial scheme implementation of the GRP operation.

FIG. 11 illustrates a parallel scheme for the first step of the GRP operation. The parallel scheme uses a hierarchical approach. In the first step, the bits whose control bit is 0 are extracted from the input. On an n-bit system, all n bits are divided into two halves 81, 82. Each half 81, 82, grabs the z bits from its n/2 bits. z bits in n/2 bits can be extracted by dividing n/2 bits into two n/4 bits halves. These n/4 bits group can be further divided until a 1 bit group has been reached. Extracting z bit in 1 bit does not require any operation. Whether the bit is z-bit or not can be known by checking its control bit. If the control bit is 0, it is z-bit. If the control bit is 1, it is not z-bit.

The z bits from the two n/2 bit groups can be combined. An example circuit 90 for combining the z bits extracted from two 4-bit groups to get the z bits in an 8-bit group is shown in FIG. 13. FIG. 12 shows a basic unit 85 used in circuit 90 and other parts in a parallel scheme of the GRP implementation. In FIG. 12, 86I is the input, 87O is the output and 88S is the select signal. If 88S is 1, 86I and 87O are connected. If 88S is 0, 86I and 87O are disconnected.

Circuit 90 in FIG. 13 combines the z bits extracted from two 4-bit groups to get the z bits in an 8-bit group. The number of 0's that are in the left half of the control bits, C₀, . . . , C₃ are determined. A one-hot code indicating the number of 0's in control bits can be used. The one-hot code uses k bits to represent k values. To represent the i_(th) value, the i_(th) bit is set to 1, and the others to 0. An example, one-hot code (S₀, S₁, S₂, S₃, S₄) in FIG. 13 encode the number of 1's in C₀, . . . , C₃, the control bits for the left half. If there is no 0 in C₀, . . . , C₃, S₀ is set to 1, and S₁, . . , S₄ are set to 0. If there are two 0's in C₀, . . . , C₃, S₂ is set to 1, and the others to 0. Using one-hot code, no extra decoder is needed to generate S₀, . . . , S₄. In FIG. 13, I0, I1, I2 and I3 contain z bits from left 4 bits group, and I4, I5, I6 and I7 contain z bits from right 4 bits group. The number of z bits in I0, I1, I2, I4 are determined by number of I's in C₀, . . . , C₃, which is indicated by (S₀, S₁, S₂, S₃, S₄). Circuit 90 removes non-z bits in I0, I1, I3 and I4 to allow z bits from the left 4 bits group to be next to the z bits from the right 4 bits group. The output, O₀, . . . , O₇, contain z bits in the 8 input bits. It will be appreciated that one of ordinary skill in the art could use the teachings of the present invention for combining z bits from two groups of any number of bits.

After setting O₀, . . . , O₇ in FIG. 13, the number of 1's in control bits for I₀, . . . , I₇ is determined in order to merge z bits in O₀, . . . , O₇ with z bits from another 8-bit group to generate z bits in a 16 bits group. Suppose the one-hot code for the number of 1's in C₀, . . . , C₃ is (S₀, S₁, S₂, S₃, S₄) and that for the number of 1's in C₄, . . . , C₇, control bits for another 4-bit group, is (T₀, T₁, T₂, T₃, T₄). The number of 1's in C₀, . . . , C₇ which is actually the sum of (S₀, S₁, S₂, S₃, S₄) and (T₀, T₁, T₂, T₃, T₄). This operation can be performed by the circuit 92 in FIG. 14. The output (U₀, U₁, . . . , U₈) is the one-hot code for the number of 1's in C₀, . . . , C₇ and can be used as select signal for combining circuit in the next stage. It will be appreciated that one with ordinary skill in the art could use the teachings of the present invention to generate a select signal for combining circuit taking any number of inputs.

The above example illustrates how to merge two results of the first step of n/2-bit GRP operations to get the result of the first step of n-bit GRP operations. The results of 1-bit groups can be used to construct results of 2-bit groups. The results of the 2-bit groups can be used to construct 4-bit groups, and the like until the result of the first step of an n-bit group is obtained. The second step can be enforced with the same circuit by flipping the control bits. In the second step, o bits need to be extracted. By flipping the control bits, o bits become z bits, and can be extracted with the same circuit used in the first step. Two of the same circuits can be used to grab z bits and o bits at the same time to allow the use of one circuit to generate the select signals. The select signal used in first step indicates the number of 1's in a set of control bits. In the second step, the number of 0's in that set is determined in order to flip the control bits. The number of 0's in a set of bits can be expeditiously determined if the number of 1s and the total number of bits in that set are known. Suppose the one-hot code of the number of 1's in a group of n bits is (S₀, S₁, . . . , S_(n−1), S_(n)). Putting these bits in the reverse order, the one-hot code of the number of 0's in that group, which can be determined as (S_(n), S_(n−1), . . . , S₁, S₀).

In the third step of a GRP operation, the results of the first two steps can be combined with circuit 90 shown in FIG. 13. Alternatively, circuit 94 shown in FIG. 15 can be used in step 3 because we know exactly n bits will be selected to reduce the size of circuit 90 in FIG. 13 almost by half.

A schematic diagram for implementation of the GRP operations in parallel is shown in FIG. 16. Module 96 that can be used to generate select signals is shown in FIG. 17.

The third step of a GRP instruction can be done with OR gates if the non-z bits in the result of the first step and non-o bits in the result of the second step are always 0. In this case, the combining circuit 94 in FIG. 15 can be replaced by a set of OR gates. To make non-z bits and non-o bits zero, modified merging circuit 110 shown in FIG. 20 is used to replace merging circuit 90 in FIG. 13. In addition, the right-most bit is AND'ed with the complement of its control bit since circuit 110 can not make that bit zero if it is a non-z bit. Thereafter, the input bits' order is reversed when o bits are extracted.

FIG. 21 is a diagram of an alternate improved implementation of 8-bit group operation. 114 extracts z bits, and 115 extracts o bits. The input bits fed into 115 are in reverse order and the control bits are inverted. For example, if 3 0's are in control bits, there are 3 z bits and 5 o bits. The outputs of 114 are set to 0 except for z bits. The outputs of 115 are set to 0 except for o bits. 113 uses OR gates to combine z bits and o bits. Using this method, the diagram of a GRP implementation in FIG. 16 changes to that in FIG. 22. The last stage in module 96 in FIG. 17 can be removed as shown in FIG. 23. One with ordinary skill in the art could use the teachings of the present invention to design GRP unit of other sizes.

A comparison of the number of transistors in the implementations of PPERM, PPERM3R and GRP follows. Since the implementations of PPERM and PPERM3R are very similar as shown in FIG. 4, we will just discuss PPERM3R. The implementation of PPERM3R comprises two parts. In a first part (30 in FIG. 4) a n by k crossbar is used, such as circuit 30 shown in FIG. 4, where k is the number of bits to permute each time. There are n horizontal wires and k(21gn+1) vertical wires. The number of transistors in each node is 21gn+1, and the total number of transistors in nodes are kn(21gn+1). In addition, there are k1gn inverters generating complement of control signals. Thus, the total number of transistors in the first part is kn(21gn+1)+k1gn.

In a second part, permuted bits are merged with the intermediate result, such as 34 in FIG. 4. There are n+k+21g(n/k) horizontal wires. 1g(n/k) are the number of bits needed to specify the starting point of m consecutive bits. There are 2n short vertical wires, which do not have to be put in metal layers. The second part also includes 1 decoder, 1g(n/k) inverters and n 2-1 multiplexers. The total number of transistors in this part is: kn(21g(n/k))/k+21g(n/k)+4n

The circuit for PPERM3R needs max{k(21gn+1),2n} vertical wires, 2n+k+21g(n/k) horizontal wires. The number of transistors is around: kn(21gn+1)+k1gn+n(21g(n/k))/k+21g(n/k)+4n ≈kn(21gn+1)+4n Most transistors are used in the crossbar and multiplexers.

In the serial scheme of the implementation of the GRP operation, an inverter is not used in each basic unit (the complement of control signals are generated outside of basic units and no inverter is used in basic units). The circuit is an (n+3) by n matrix. Each node uses 4 transistors. n inverters are required to generate complement of control signals. The total number of transistors in circuit is 4n(n+3)+2n. There are 6n vertical wires and 4n+1 horizontal used in the serial scheme shown in FIG. 10.

For the parallel scheme of the implementation of the GRP operation, there are 1gn stages as shown in FIG. 22. In the i_(th) stage of FIG. 22, there are n/2^(i−1) blocks, each of which is a 2^(i−1)+1 by 2 ^(i) matrix similar to the one in FIG. 20. The total number of nodes in i_(th) stage is (2^(i−1)+1)2^(i) n/2^(i−1)=(2^(i)+2)n Each node has only one transistor as shown in FIG. 12. Plus transistors in n OR gates, the total number of nodes in FIG. 22 is

$\begin{matrix} {{{\sum\limits_{i = 1}^{\lg\mspace{11mu} n}{\left( {2^{i} + 2} \right)n}} + {4n}} = {{\sum\limits_{i = 1}^{\lg\mspace{11mu} n}{2^{i}\; n}} + {\sum\limits_{i = 1}^{\lg\mspace{11mu} n}{2\; n}} + {4n}}} \\ {= {{2{n\left( {n - 1} \right)}} + {2\; n\mspace{11mu}\lg\mspace{11mu} n} + {4n}}} \\ {= {{2n^{2}} + {2n\mspace{11mu}\lg\mspace{11mu} n} + {2n}}} \end{matrix}$

For the select signal generation circuit in FIG. 23, there are 1gn stages. Each block in stage 0 is an inverter. For other stage i>0, there are n/2^(i) blocks in it, and each block is a 2^(i−1)+1 by 2^(i)+1 matrix like circuit 92 in FIG. 14. The number of transistors in a circuit shown in FIG. 23 is:

$\begin{matrix} {{{\sum\limits_{i = 1}^{{\lg\mspace{11mu} n} - 1}{\left( {2^{i - 1} + 1} \right)\left( {2^{i} + 1} \right){n/2^{i}}}} + {2n}} = {{\sum\limits_{i = 1}^{{\lg\mspace{11mu} n} - 1}{\left( {2^{{2i} - 1} + \; 2^{i} + 2^{i - 1} + 1} \right){n/2^{i}}}} + {2n}}} \\ {= {{n^{2}/2} + {3n\mspace{11mu}\lg\mspace{11mu}{n/2}} + {3{n/2}} - 2}} \end{matrix}$

Therefore, the total number of transistors for implementation of n bit GRP operation is: 5n²/2+7n1gn/2+7n/2-2

As for the number of tracks for this implementation, the number of vertical tracks is around 6n and that for horizontal tracks is around (n1gn/2+2n).

TABLE 8 # of # of delay in horizontal vertical # of # of wires wires transistors transistors Crossbar 64 448 73 k 7 PPERM3R or 142 128  7 k 8 PPERM unit GRP unit 257 384 17 k 66 Serial scheme GRP unit 320 384 12 k 10 Parallel scheme

The GRP instruction can be used to permute subwords packed into more than one register. If a register is n bits, two registers are 2n bits. The GRP instruction can be used for 2n-bit permutations by using an instruction such as the SHIFT PAIR instruction in PA-RISC, as described in Ruby Lee, “Precision Architecture”, IEEE Computer, Vol. 22, No. 1, pp. 78-91, January 1989 and Ruby Lee, Michael Mahon, Dale Morris, “Pathlength Reduction Features in the PA-RISC Architecture”, Proceedings of IEEE Compcon, Feb. 24-28, 1992, San Francisco, Calif., pp. 129-135, hereby incorporated by reference into this application. The SHIFT PAIR instruction can process operands that cross word boundaries. This instruction concatenates two source registers to form a double-word valued, then extracts any contiguous single-word value.

FIGS. 18A and 18B illustrate an example of performing 2n-bit permutations using SHIFT PAIR and GRP instructions. In this example, R1 and R2 store the bits to be permuted, and the results will be put in R3 and R4. Source registers R1 and R2 are divided into two groups using two GRP instructions. One GRP instruction is for R1 and one GRP instruction is for R2. In R1, the bits going to register R3 are put into the left group and the bits going to R4 into the right group. In R2 the bits going to register R4 are put into the left group, and the bits going to register R3 are put into the right group. After performing block 200, register R1 is divided into left group 205 a and right group 205 b as shown in FIG. 18B. Register R2 is divided into left group 207 a and right group 207 b.

In block 201, using two SHIFT PAIR instructions, all bits going to register R3 are put into R3 and all bits going to register R4 are put into R4. After the implementation of block 201, register R3 includes the bits of right group 207 b and left group 205 a and register R4 includes the bits of right group 205 b and left group 207 a. In block 202, considering R3 and R4 as separate n-bit words, n-bit permutations are performed on register R3 and register R4 using GRP instructions. Each of R3 and R4 can use up to 1gn instructions. In total, excluding the instructions needed for loading control bits, (21 gn+4) instructions are needed to do a 2n-bit permutation. Accordingly, with 64 bit registers, a 128 bit permutation can be performed with 16 instructions.

The GRP instruction is also efficient for permuting multi-bit subwords. Fewer GRP instructions are used to permute larger subwords. For example, in a 64-bit register with 1-bit subwords there are 64 subwords needing a sequence of at most 1g64=6 GRP instructions for any arbitrary permutation of the 64 subwords. In a 64 bit register with 8-bit subwords there are 8 subwords needing a sequnece of at most 1g8=3 GRP instructions for any arbitrary permutation of the 8 subwords. In the example shown in FIG. 7, if the elements in the permutation (5, 0, 1, 2, 4, 3, 7, 6) are 8-bit subwords in a 64-bit processor, two 64-bit GRP instructions are able to do the subword permutation. The control bits for the two GRP instructions can be determined from control bits generated in FIG. 7 by substituting each 0 or 1 with eight consecutive 0's or 1's, respectively. Accordingly, each of the two GRP instructions has 64 control bits.

Table 9 shows a comparison of the performance of the permutation methods on 64-bit systems. GRP is faster than PPERM3R. The conventional ISA method and table lookup methods were described in the background of the invention. The table lookup method includes 23 instructions in the table lookup method which includes 8 LOAD instructions, each of which can cause a cache miss, or other memory delay, resulting in an execution time that can be much longer than that for 23 instructions that do not use memory.

TABLE 9 Current Table Instruction PPERM PPERM3R GRP ISA Lookup Number of 2 3 2  2  2 operands Max number 15 8 6 256 23 of instructions (4n) (typically)

Table 10 shows the number of instructions needed to do permutations in DES with table lookup and the PPERM3R instruction and GRP instructions for different methods. The first four permutations are used in encryption and decryption. The expansion permutation and P-Box are in the loop and are performed 16 times for each block. The other two permutations are used in key generation, and the compression permutation is performed 16 times. For the PPERM3R and GRP methods, the instructions needed for loading control bits are included. If the same permutation is repeated on many 64-bit data, then the control bits are loaded only once, and the cost of loading can be amortized over all these permutations. For the table lookup, the source is divided into sections of 8 bits each, and includes the instructions that load the pointers to the permutation tables. The instructions equivalent to EXTRACT and Load Indexed in PA-RISC are available. As shown in Table 10, while the GRP instruction needs the fewest instructions, the table lookup needs the most.

TABLE 10 Number of instructions required for permutations in DES Load control Control bits already Table bits loaded Lookup PPERM3R GRP PPERM3R GRP Initial permutation 31 16 12 8 6 Final permutation 31 16 12 8 6 Expansion 15 12 9 6 5 permutation P-Box 15 8 8 4 4 Key permutation 31 14 12 7 6 Compression 27 12 10 6 5 permutation

The relative number of instructions required for the encryption and key generation in DES is shown in FIG. 19. The smaller numbers provide better performance. The number of cycles required by each method is not shown because this depends on the processor's microarchitecture. The left three bars are for encryption explicitly doing all 6 permutations using the specified permutation methodology. The table lookup method used by conventional microprocessors needs 35% more instructions for DES than the GRP instruction. Different optimized versions of DES may eliminate some of these permutations, resulting in different instruction counts. The right three bars are for key generation, where the computation is dominated by the two key permutations. The table lookup method needs more than 3 times the number of instructions than the GRP instruction method.

Table 11 shows the number of instructions needed to do permutations in Serpent with the table lookup method, GRP instruction method counting the instructions which load control bits and GRP instruction method not counting the instructions which load control bits (control bits already loaded into registers). The same assumptions are used as in Table 9 and Table 10. Since the permutations are performed on 128-bit data, two LOADs and two ORs are used for each section of the table lookup.

TABLE 11 Number of instructions required for permutations in Serpent GRP GRP Table Load control Control bits already Lookup bits loaded Initial 110 26 14 permutation Final 110 14 8 permutation

It is to be understood that the above-described embodiments are illustrative of only a few of the many possible specific embodiments which can represent applications of the principles of the invention. Numerous and varied other arrangements can be readily devised in accordance with these principles by those skilled in the art without departing from the spirit and scope of the invention. 

1. A computer system for performing permutations comprising: a source register; a configuration register; a destination register; in response to a GRP instruction dividing n bits in said source register into a first group and a second group, wherein each of said n bits is selected into said first group if a corresponding bit in the configuration register is “0” and each of said n bits is selected into said second group if a corresponding bit in the configuration register is “1”, concatenating the bits of said first group and the bits of said second group and placing the concatenated bits in said destination register.
 2. A computer system of claim 1 wherein the relative positions of bits within said first group and said second group do not change.
 3. A computer readable medium having stored thereon data representing a permutation instructions, which when executed by a processor, causes the processor to permute a source sequence of bits into another sequences of bits using a GRP instruction by dividing an arrangement of a source sequence of bits into a first group and a second group, wherein each of said n bits is selected into said first group if a corresponding bit in the configuration register is “0” and each of said n bits is selected into said second group if a corresponding bit in the configuration register is “1”, concatenating the bits of said first group and the bits of said second group and placing the concatenated bits in said destination register.
 4. A computer readable medium of claim 3 wherein the relative positions of bits within said first group and said second group do not change.
 5. A cryptographic system, a source register; a destination register; comprising a sequence of permutation instructions, the sequence of permutation instructions which when executed by a processor, cause the processor to permute a source sequence of bits into one or more intermediate sequences of bits using a GRP instruction by dividing an arrangement of a source sequence of bits from said source register into a first group and a second group, wherein each of said n bits is selected into said first group if a corresponding bit in the configuration register is “0” and each of said n bits is selected into said second group if a corresponding bit in the configuration register is “1”, concatenating the bits of said first group and the bits of said second group and placing the concatenated bits in said destination register.
 6. A cryptographic system of claim 5 wherein the relative positions of bits within said first group and said second group do not change.
 7. A circuit for implementing a permutation instruction comprising: a destination register; a first hierarchical component of a plurality of operation units that select data bits that have a corresponding control bit equal to 1; a second hierarchical component that is the same as said first hierarchical component but takes data bits in reverse order and complemented control bits as input; and output of said first hierarchical component is combined with output of said second hierarchical component and is placed in said destination register.
 8. The circuit of claim 7 wherein said permutation instruction is for an n bit operation and control bits are encoded by one-hot code for combining results of two n bit operations into a 2n bit operation. 